An Ant Colony Optimization Approach for the Capacitated Vehicle Routing Problem with Simultaneous Delivery and Pick-up

We propose an Ant Colony Optimization (ACO) algorithm to the NPhard Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRPSDP). In VRPSDP, commodities are delivered to customers from a single depot utilizing a fleet of identical vehicles and empty packages are collected from the customers and transported back to the depot. The objective is to minimize the total distance traveled. The algorithm is tested with the well-known benchmark problems from the literature. The experimental study indicates that our approach produces comparable results to those of the benchmark problems in the literature.